Optimizing routing and delivery patterns with multi-compartment vehicles

Retailers usually apply repetitive weekly delivery patterns when scheduling the workforce for shelf replenishment, defining cyclic transportation routes and managing warehouse capacities. In doing so, all logistics subsystems are jointly scheduled. Grocery products require different temperature zones. As long as transport was in separated vehicles due to requirements, it not possible coordinate deliveries across The recent introduction of multi-compartment trucks has changed this allows joint deliveries. This simultaneous multiple product segments impacts as, example, low volume can be delivered more frequently if they transported together with high segments. We address problem vehicles. After deriving decision-relevant costs, we propose a novel model that defines Periodic Multi-Compartment Vehicle Routing Problem. is solved by an integrated framework determines within Adaptive Large Neighborhood Search combination solving routing problem. analyze impact selecting show efficiency our planning approach using numerical studies. Joint generates cost savings up 15%. Furthermore, algorithm provided also improve single-segment problems 3% compared state-of-the art benchmark. Beyond demonstrate applicability advantage case study large German grocery retailer.